Sub-block mv inheritance between color components

ABSTRACT

Devices, systems and methods for sub-block based prediction are described. In a representative aspect, a method for video processing includes partitioning a first component of a current video block into a first set of sub-blocks and partitioning a second component of the current video block into a second set of sub-blocks. A sub-block of the second component corresponds to one or more sub-blocks of the first component. The method also includes deriving, based on a color format of the current video block, motion vectors for a sub-block of the second component based on motion vectors for one or more corresponding sub-blocks of the first color component.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of International Application No. PCT/IB2019/055247, filed on Jun. 21, 2019, which claims the priority to and benefits of International Patent Application No. PCT/CN2018/092118, filed on Jun. 21, 2018, PCT/CN2018/114931, filed on Nov. 10, 2018. All the aforementioned patent applications are hereby incorporated by reference in their entireties.

TECHNICAL FIELD

This patent document is directed generally to image and video coding technologies.

BACKGROUND

Motion compensation is a technique in video processing to predict a frame in a video, given the previous and/or future frames by accounting for motion of the camera and/or objects in the video. Motion compensation can be used in the encoding and decoding of video data for video compression.

SUMMARY

Devices, systems and methods related to sub-block based prediction for image and video coding are described.

In one representative aspect, the disclosed technology may be used to provide a method for video encoding. This method includes partitioning a first component of a current video block into a first set of sub-blocks and partitioning a second component of the current video block into a second set of sub-blocks. A sub-block of the second component corresponds to one or more sub-blocks of the first component. The method also includes deriving, based on a color format of the current video block, motion vectors for the sub-block of the second component based on motion vectors for one or more corresponding sub-blocks of the first color component.

In another representative aspect, the disclosed technology may be used to provide a method for video decoding. The method includes receiving a block of video data that comprises a first component and at least a second component. The first component is partitioned into a first set of sub-blocks and the second component is partitioned into a second set of sub-blocks. A sub-block of the second component corresponds to one or more sub-blocks of the first component. The method includes deriving, based on a color format of the block of video data, motion vectors for a sub-block of the second component based on motion vectors for one or more corresponding sub-blocks of the first color component. The method also includes reconstructing, based on the derived motion vectors, the block of video data or decoding other blocks of video data in a same picture.

In yet another representative aspect, the above-described method is embodied in the form of processor-executable code and stored in a computer-readable program medium.

In yet another representative aspect, a device that is configured or operable to perform the above-described method is disclosed. The device may include a processor that is programmed to implement this method.

In yet another representative aspect, a video encoder or a video decoder apparatus may implement a method as described herein.

The above and other aspects and features of the disclosed technology are described in greater detail in the drawings, the description and the claims.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows an example of sub-block based prediction.

FIG. 2 shows an example of a simplified affine motion model.

FIG. 3 shows an example of an affine motion vector field (MVF) per sub-block.

FIG. 4 shows an example of motion prediction using the alternative temporal motion vector prediction (ATMVP) algorithm for a coding unit (CU).

FIG. 5 shows an example of one CU with four sub-blocks and neighboring blocks.

FIG. 6 shows an example of an optical flow trajectory used by the bi-directional optical flow (BIO) algorithm.

FIG. 7 shows an example of bilateral matching in the frame-rate up conversion (FRUC) algorithm.

FIG. 8 shows an example of template matching in the FRUC algorithm.

FIG. 9 shows an example of unilateral Motion Estimation (ME) in the FRUC method.

FIG. 10 shows an example of deriving a motion vector (MV) of a component for sub-blocks in the 4:2:0 format in accordance with the present technology.

FIG. 11 shows another example of deriving an MV of a component for sub-blocks in the 4:2:0 format in accordance with the present technology.

FIG. 12 shows yet another example of deriving an MV of a component for sub-blocks in accordance with the present technology.

FIG. 13 is a flowchart of an example method for video encoding in accordance with one or more embodiments of the present technology.

FIG. 14 is a flowchart of another example method for video encoding in accordance with one or more embodiments of the present technology.

FIG. 15 is a block diagram illustrating an example encoding apparatus that can be utilized to implement various portions of the presently disclosed technology.

FIG. 16 is a block diagram illustrating an example encoding apparatus that can be utilized to implement various portions of the presently disclosed technology.

FIG. 17 is a block diagram illustrating an example of the architecture for a computer system or other control device that can be utilized to implement various portions of the presently disclosed technology.

FIG. 18 shows a block diagram of an example embodiment of a mobile device that can be utilized to implement various portions of the presently disclosed technology.

DETAILED DESCRIPTION

Due to the increasing demand of higher resolution video, video coding methods and techniques are ubiquitous in modern technology. Video codecs typically include an electronic circuit or software that compresses or decompresses digital video, and are continually being improved to provide higher coding efficiency. A video codec converts uncompressed video to a compressed format or vice versa. There are complex relationships between the video quality, the amount of data used to represent the video (determined by the bit rate), the complexity of the encoding and decoding algorithms, sensitivity to data losses and errors, ease of editing, random access, and end-to-end delay (latency). The compressed format usually conforms to a standard video compression specification, e.g., the High Efficiency Video Coding (HEVC) standard (also known as H.265 or MPEG-H Part 2), the Versatile Video Coding standard to be finalized, or other current and/or future video coding standards.

Sub-block based prediction is first introduced into the video coding standard by the High Efficiency Video Coding (HEVC) standard. With sub-block based prediction, a block, such as a Coding Unit (CU) or a Prediction Unit (PU), is divided into several non-overlapped sub-blocks. Different sub-blocks may be assigned different motion information, such as reference index or motion vector (MV), and motion compensation (MC) is performed individually for each sub-block. FIG. 1 shows an example of sub-block based prediction.

Embodiments of the disclosed technology may be applied to existing video coding standards (e.g., HEVC, H.265) and future standards to improve runtime performance. Section headings are used in the present document to improve readability of the description and do not in any way limit the discussion or the embodiments (and/or implementations) to the respective sections only.

Future video coding technologies are explored using a reference software known as the Joint Exploration Model (JEM). In JEM, sub-block based prediction is adopted in several coding tools, such as affine prediction, alternative temporal motion vector prediction (ATMVP), spatial-temporal motion vector prediction (STMVP), bi-directional optical flow (BIO), Frame-Rate Up Conversion (FRUC), Locally Adaptive Motion Vector Resolution (LAMVR), Overlapped Block Motion Compensation (OBMC), Local Illumination Compensation (LIC), and Decoder-side Motion Vector Refinement (DMVR).

In HEVC, only a translation motion model is applied for motion compensation prediction (MCP). However, the camera and objects may have many kinds of motion, e.g. zoom in/out, rotation, perspective motions, and/or other irregular motions. JEM, on the other hand, applies a simplified affine transform motion compensation prediction. FIG. 2 shows an example of an affine motion field of a block 200 described by two control point motion vectors V₀ and V₁. The motion vector field (MVF) of the block 200 can be described by the following equation:

$\begin{matrix} \left\{ \begin{matrix} {v_{x} = {{\frac{\left( {v_{1x} - v_{0x}} \right)}{w}x} - {\frac{\left( {v_{1y} - v_{0y}} \right)}{w}y} + v_{0x}}} \\ {v_{y} = {{\frac{\left( {v_{1y} - v_{0y}} \right)}{w}x} + {\frac{\left( {v_{1x} - v_{0x}} \right)}{w}y} + v_{0y}}} \end{matrix} \right. & {{Eq}.\mspace{14mu} (1)} \end{matrix}$

FIG. 3 shows an example of affine MVF per sub-block for a block 300. To derive motion vector of each M×N sub-block, the motion vector of the center sample of each sub-block can be calculated according to Eq. (1), and rounded to the motion vector fraction accuracy (e.g., 1/16 in JEM). Then the motion compensation interpolation filters can be applied to generate the prediction of each sub-block with derived motion vector. After the MCP, the high accuracy motion vector of each sub-block is rounded and saved as the same accuracy as the normal motion vector.

In the JEM, there are two affine motion modes: AF_INTER mode and AF_MERGE mode. For CUs with both width and height larger than 8, AF_INTER mode can be applied. An affine flag in CU level is signaled in the bitstream to indicate whether AF_INTER mode is used. In the AF_INTER mode, a candidate list with motion vector pair {(v₀, v₁)|v₀={v_(A), v_(B), v_(C)}, v₁={v_(D),v_(E)}} is constructed using the neighboring blocks.

In JEM, the non-merge affine mode can be used only when the width and the height of the current block are both larger than 8; the merge affine mode can be used only when the area (i.e. width×height) of the current block is not smaller than 64.

FIG. 4 shows an example of alternative temporal motion vector prediction (ATMVP) motion prediction process for a CU 400. The ATMVP method predicts the motion vectors of the sub-CUs 401 within a CU 400 in two steps. The first step is to identify the corresponding block 451 in a reference picture 450 with a temporal vector. The reference picture 450 is also referred to as the motion source picture. The second step is to split the current CU 400 into sub-CUs 401 and obtain the motion vectors as well as the reference indices of each sub-CU from the block corresponding to each sub-CU.

In the first step, a reference picture 450 and the corresponding block is determined by the motion information of the spatial neighboring blocks of the current CU 400. In the second step, a corresponding block of the sub-CU 451 is identified by the temporal vector in the motion source picture 450, by adding to the coordinate of the current CU the temporal vector. For each sub-CU, the motion information of its corresponding block (e.g., the smallest motion grid that covers the center sample) is used to derive the motion information for the sub-CU. After the motion information of a corresponding N×N block is identified, it is converted to the motion vectors and reference indices of the current sub-CU, in the same way as TMVP of HEVC, wherein motion scaling and other procedures apply.

In the Spatial-Temporal Motion Vector Prediction (STMVP) method, the motion vectors of the sub-CUs are derived recursively, following raster scan order. FIG. 5 shows an example of one CU with four sub-blocks and neighboring blocks. Consider an 8×8 CU 500 that includes four 4×4 sub-CUs A (501), B (502), C (503), and D (504). The neighboring 4×4 blocks in the current frame are labelled as a (511), b (512), c (513), and d (514).

The motion derivation for sub-CU A starts by identifying its two spatial neighbors. The first neighbor is the N×N block above sub-CU A 501 (block c 513). If this block c (513) is not available or is intra coded the other N×N blocks above sub-CU A (501) are checked (from left to right, starting at block c 513). The second neighbor is a block to the left of the sub-CU A 501 (block b 512). If block b (512) is not available or is intra coded other blocks to the left of sub-CU A 501 are checked (from top to bottom, staring at block b 512). The motion information obtained from the neighboring blocks for each list is scaled to the first reference frame for a given list. Next, temporal motion vector predictor (TMVP) of sub-block A 501 is derived by following the same procedure of TMVP derivation as specified in HEVC. The motion information of the collocated block at block D 704 is fetched and scaled accordingly. Finally, after retrieving and scaling the motion information, all available motion vectors are averaged separately for each reference list. The averaged motion vector is assigned as the motion vector of the current sub-CU.

The bi-directional optical flow (BIO) method is a sample-wise motion refinement performed on top of block-wise motion compensation for bi-prediction. In some implementations, the sample-level motion refinement does not use signaling.

Let I^((k)) be the luma value from reference k (k=0, 1) after block motion compensation, and ∂I^((k))/∂x, ∂I^((k))/∂y are horizontal and vertical components of the I^((k)) gradient, respectively. Assuming the optical flow is valid, the motion vector field (v_(x), v_(y)) is given by:

∂I ^((k)) /∂t+v _(x) ∂I ^((k)) /∂x+v _(y) ∂I ^((k)) /∂y=0.  Eq. (2)

Combining this optical flow equation with Hermite interpolation for the motion trajectory of each sample results in a unique third-order polynomial that matches both the function values I^((k)) and ∂I^((k))/∂x, ∂I^((k))/∂y derivatives at the ends. The value of this polynomial at t=0 is the BIO prediction:

pred_(BIO)=½·(I ⁽⁰⁾ +I ⁽¹⁾ +v _(x)/2·(τ₁ ∂I ⁽¹⁾ /∂x−τ ₀ ∂I ⁽⁰⁾ /∂x)+v _(y)/2·(τ₁ ∂I ⁽¹⁾)/∂y−τ ₀ ∂I ⁽⁰⁾ /∂y)).  Eq. (3)

FIG. 6 shows an example optical flow trajectory in the Bi-directional Optical flow (BIO) method. Here, τ₀ and τ₁ denote the distances to the reference frames. Distances τ₀ and τ₁ are calculated based on POC for Ref₀ and Ref₁: τ₀=POC(current)−POC(Ref₀), τ₁=POC(Ref₁)−POC(current). If both predictions come from the same time direction (either both from the past or both from the future) then the signs are different (e.g., τ₀·τ₁<0). In this case, BIO is applied if the prediction is not from the same time moment (e.g., τ₀≠τ₁). Both referenced regions have non-zero motion (e.g., MVx₀, MVy₀, MVx₁, MVy₁≠0) and the block motion vectors are proportional to the time distance (e.g., MVx₀/MVx₁=MVy₀/MVy₁=−τ₀/τ₁). In the JEM, BIO can be applied to all bi-predicted blocks when the two predictions are from different reference pictures. When Local Illumination Compensation (LIC) is enabled for a CU, BIO can be disabled.

In some cases, a FRUC flag can be signaled for a CU when its merge flag is true. When the FRUC flag is false, a merge index can be signaled and the regular merge mode is used. When the FRUC flag is true, an additional FRUC mode flag can be signaled to indicate which method (e.g., bilateral matching or template matching) is to be used to derive motion information for the block.

At the encoder side, the decision on whether using FRUC merge mode for a CU is based on RD cost selection as done for normal merge candidate. For example, multiple matching modes (e.g., bilateral matching and template matching) are checked for a CU by using RD cost selection. The one leading to the minimal cost is further compared to other CU modes. If a FRUC matching mode is the most efficient one, FRUC flag is set to true for the CU and the related matching mode is used.

Typically, motion derivation process in FRUC merge mode has two steps: a CU-level motion search is first performed, then followed by a Sub-CU level motion refinement. At CU level, an initial motion vector is derived for the whole CU based on bilateral matching or template matching. First, a list of MV candidates is generated and the candidate that leads to the minimum matching cost is selected as the starting point for further CU level refinement. Then a local search based on bilateral matching or template matching around the starting point is performed. The MV results in the minimum matching cost is taken as the MV for the whole CU. Subsequently, the motion information is further refined at sub-CU level with the derived CU motion vectors as the starting points.

FIG. 7 shows an example of bilateral matching used in the Frame-Rate Up Conversion (FRUC) method. The bilateral matching is used to derive motion information of the current CU by finding the closest match between two blocks along the motion trajectory of the current CU (700) in two different reference pictures (710, 711). Under the assumption of continuous motion trajectory, the motion vectors MV0 (701) and MV1 (702) pointing to the two reference blocks are proportional to the temporal distances, e.g., TD0 (703) and TD1 (704), between the current picture and the two reference pictures. In some embodiments, when the current picture 700 is temporally between the two reference pictures (710, 711) and the temporal distance from the current picture to the two reference pictures is the same, the bilateral matching becomes mirror based bi-directional MV.

FIG. 8 shows an example of template matching used in the Frame-Rate Up Conversion (FRUC) method. Template matching can be used to derive motion information of the current CU 800 by finding the closest match between a template (e.g., top and/or left neighboring blocks of the current CU) in the current picture and a block (e.g., same size to the template) in a reference picture 810. Except the aforementioned FRUC merge mode, the template matching can also be applied to AMVP mode. In both JEM and HEVC, AMVP has two candidates. With the template matching method, a new candidate can be derived. If the newly derived candidate by template matching is different to the first existing AMVP candidate, it is inserted at the very beginning of the AMVP candidate list and then the list size is set to two (e.g., by removing the second existing AMVP candidate). When applied to AMVP mode, only CU level search is applied.

The MV candidate set at CU level can include the following: (1) original AMVP candidates if the current CU is in AMVP mode, (2) all merge candidates, (3) several MVs in the interpolated MV field (described later), and/or (4) top and left neighboring motion vectors.

When using bilateral matching, each valid MV of a merge candidate can be used as an input to generate a MV pair with the assumption of bilateral matching. For example, one valid MV of a merge candidate is (MVa, ref_(a)) at reference list A. Then the reference picture ref_(b) of its paired bilateral MV is found in the other reference list B so that ref_(a) and ref_(b) are temporally at different sides of the current picture. If such a ref_(b) is not available in reference list B, ref_(b) is determined as a reference which is different from ref_(a) and its temporal distance to the current picture is the minimal one in list B. After ref_(b) is determined, MVb is derived by scaling MVa based on the temporal distance between the current picture and ref_(a), ref_(b).

In some implementations, four MVs from the interpolated MV field can also be added to the CU level candidate list. More specifically, the interpolated MVs at the position (0, 0), (W/2, 0), (0, H/2) and (W/2, H/2) of the current CU are added. When FRUC is applied in AMVP mode, the original AMVP candidates are also added to CU level MV candidate set. In some implementations, at the CU level, 15 MVs for AMVP CUs and 13 MVs for merge CUs can be added to the candidate list.

The MV candidate set at sub-CU level includes an MV determined from a CU-level search, (2) top, left, top-left and top-right neighboring MVs, (3) scaled versions of collocated MVs from reference pictures, (4) one or more ATMVP candidates (e.g., up to four), and/or (5) one or more STMVP candidates (e.g., up to four). The scaled MVs from reference pictures are derived as follows. The reference pictures in both lists are traversed. The MVs at a collocated position of the sub-CU in a reference picture are scaled to the reference of the starting CU-level MV. ATMVP and STMVP candidates can be the four first ones. At the sub-CU level, one or more MVs (e.g., up to 17) are added to the candidate list.

Before coding a frame, interpolated motion field is generated for the whole picture based on unilateral ME. Then the motion field may be used later as CU level or sub-CU level MV candidates.

In some embodiments, the motion field of each reference pictures in both reference lists is traversed at 4×4 block level. FIG. 9 shows an example of unilateral Motion Estimation (ME) 900 in the FRUC method. For each 4×4 block, if the motion associated to the block passing through a 4×4 block in the current picture and the block has not been assigned any interpolated motion, the motion of the reference block is scaled to the current picture according to the temporal distance TD0 and TD1 (the same way as that of MV scaling of TMVP in HEVC) and the scaled motion is assigned to the block in the current frame. If no scaled MV is assigned to a 4×4 block, the block's motion is marked as unavailable in the interpolated motion field.

When a motion vector points to a fractional sample position, motion compensated interpolation is needed. To reduce complexity, bi-linear interpolation instead of regular 8-tap HEVC interpolation can be used for both bilateral matching and template matching.

The calculation of matching cost is a bit different at different steps. When selecting the candidate from the candidate set at the CU level, the matching cost can be the absolute sum difference (SAD) of bilateral matching or template matching. After the starting MV is determined, the matching cost C of bilateral matching at sub-CU level search is calculated as follows:

C=SAD+w·(|MV_(x)−MV_(x) ^(s)|+|MV_(y)−MV_(y) ^(a)|)  Eq. (4)

Here, w is a weighting factor. In some embodiments, w can be empirically set to 4. MV and MV^(s) indicate the current MV and the starting MV, respectively. SAD may still be used as the matching cost of template matching at sub-CU level search.

In FRUC mode, MV is derived by using luma samples only. The derived motion will be used for both luma and chroma for MC inter prediction. After MV is decided, final MC is performed using 8-taps interpolation filter for luma and 4-taps interpolation filter for chroma.

MV refinement is a pattern based MV search with the criterion of bilateral matching cost or template matching cost. In the JEM, two search patterns are supported—an unrestricted center-biased diamond search (UCBDS) and an adaptive cross search for MV refinement at the CU level and sub-CU level, respectively. For both CU and sub-CU level MV refinement, the MV is directly searched at quarter luma sample MV accuracy, and this is followed by one-eighth luma sample MV refinement. The search range of MV refinement for the CU and sub-CU step are set equal to 8 luma samples.

In the bilateral matching merge mode, bi-prediction is applied because the motion information of a CU is derived based on the closest match between two blocks along the motion trajectory of the current CU in two different reference pictures. In the template matching merge mode, the encoder can choose among uni-prediction from list0, uni-prediction from list1, or bi-prediction for a CU. The selection ca be based on a template matching cost as follows:

If costBi<=factor*min (cost0, cost1)

-   -   bi-prediction is used;     -   Otherwise, if cost0<=cost1     -   uni-prediction from list0 is used;     -   Otherwise,     -   uni-prediction from list1 is used;

Here, cost0 is the SAD of list0 template matching, cost1 is the SAD of list1 template matching and costBi is the SAD of bi-prediction template matching. For example, when the value of factor is equal to 1.25, it means that the selection process is biased toward bi-prediction. The inter prediction direction selection can be applied to the CU-level template matching process.

Human visual system is less sensitive to the position and motion of color than luminance. Thus, bandwidth can be optimized by storing more luminance detail than color detail. In video systems, this is achieved by using color difference components. The signal is divided into a luma (Y′) component and two color difference (chroma) components. Chroma subsampling is the practice of encoding images by implementing less resolution for chroma information than for luma information, taking advantage of the human visual system's lower acuity for color differences than for luminance. For example, common types of subsampling include 4:2:2 (the two chroma components are sampled at half the sample rate of luma), 4:1:1 (the horizontal color resolution is quartered), and 4:2:0 (the vertical resolution is halved as compared to 4:1:1 because the Cb and Cr channels are only sampled on each alternate line). In an example, the HEVC standard defines how to derive the MV used for MC in chroma components (noted as mvC) from the MV used for MC in the luma component (noted as my). Generally speaking, mvC is calculated as my multiplying a factor, which relies on the color format, such as 4:2:0 or 4:2:2.

Intra block copy (IBC, or intra picture block compensation), also named current picture referencing (CPR) was adopted in HEVC screen content coding extensions (SCC). This tool is very efficient for coding of screen content video in that repeated patterns in text and graphics rich content occur frequently within the same picture. Having a previously reconstructed block with equal or similar pattern as a predictor can effectively reduce the prediction error and therefore improve coding efficiency.

Similar to the design of CRP in HEVC SCC, In VVC, the use of the IBC mode is signaled at both sequence and picture level. When the IBC mode is enabled at sequence parameter set (SPS), it can be enabled at picture level. When the IBC mode is enabled at picture level, the current reconstructed picture is treated as a reference picture. Therefore, no syntax change on block level is needed on top of the existing VVC inter mode to signal the use of the IBC mode.

Features of IBC mode include the following:

-   -   It is treated as a normal inter mode. Therefore, merge and skip         modes are also available for the IBC mode. The merge candidate         list construction is unified, containing merge candidates from         the neighboring positions that are either coded in the IBC mode         or the HEVC inter mode. Depending on the selected merge index,         the current block under merge or skip mode can merge into either         an IBC mode coded neighbor or otherwise an normal inter mode         coded one with different pictures as reference pictures.     -   Block vector prediction and coding schemes for the IBC mode         reuse the schemes used for motion vector prediction and coding         in the HEVC inter mode (AMVP and MVD coding).     -   The motion vector for the IBC mode, also referred as block         vector, is coded with integer-pel precision, but stored in         memory in 1/16-pel precision after decoding as quarter-pel         precision is required in interpolation and deblocking stages.         When used in motion vector prediction for the IBC mode, the         stored vector predictor will be right shifted by 4.     -   Search range: it is restricted to be within the current CTU.     -   CPR is disallowed when affine mode/triangular mode/GBI/weighted         prediction is enabled.

In some cases, pairwise average candidates are generated by averaging predefined pairs of candidates in the current merge candidate list, and the predefined pairs are defined as {(0, 1), (0, 2), (1, 2), (0, 3), (1, 3), (2, 3)}, where the numbers denote the merge indices to the merge candidate list. The averaged motion vectors are calculated separately for each reference list. If both motion vectors are available in one list, these two motion vectors are averaged even when they point to different reference pictures; if only one motion vector is available, use the one directly; if no motion vector is available, keep this list invalid. The pairwise average candidates replaces the combined candidates in HEVC standard. Suppose the MVs of two merge candidates are MV₀=(MV_(0x), MV_(0y)) and MV₁=(MV_(1x), MV_(1y)), then the MV of the pairwise merge candidate denoted as MV*=(MV*_(x), MV*_(y)) is derived as

MV*_(x)=(MV_(0x)+MV_(1x))/2, and

MV*y=(MV_(0y)+MV_(1y))/2.

In addition, when MV₀ and MV₁ refer to the current picture (i.e., CPR mode), MV*_(x) and MV*_(y) are further rounded to remove the part with a higher precision than full pixel to make sure the integer MV is obtained:

MV*_(x)=(MV*_(x)/16)<<4, and

MV*_(y)=(MV*_(y)/16)<<4.

It is noted that for each pair, if one of the two is coded with CPR and the other is not, such pair is disallowed to generate the pairwise average candidate.

The concept of the triangular prediction mode (TPM) is to introduce a new triangular partition for motion compensated prediction. It splits a CU into two triangular prediction units, in either diagonal or inverse diagonal direction. Each triangular prediction unit in the CU is inter-predicted using its own uni-prediction motion vector and reference frame index which are derived from a single uni-prediction candidate list. An adaptive weighting process is performed to the diagonal edge after predicting the triangular prediction units. Then, the transform and quantization process are applied to the whole CU. It is noted that this mode is only applied to merge mode (note: skip mode is treated as a special merge mode). Uni-prediction candidate list for TPM.

The uni-prediction candidate list, named TPM motion candidate list, consists of five uni-prediction motion vector candidates. It is derived from seven neighboring blocks including five spatial neighboring blocks and two temporal co-located blocks. The motion vectors of the seven neighboring blocks are collected and put into the uni-prediction candidate list according in the order of uni-prediction motion vectors, L0 motion vector of bi-prediction motion vectors, L1 motion vector of bi-prediction motion vectors, and averaged motion vector of the L0 and L1 motion vectors of bi-prediction motion vectors. If the number of candidates is less than five, zero motion vector is added to the list. Motion candidates added in this list for TPM are called TPM candidates, motion information derived from spatial/temporal blocks are called regular motion candidates.

More specifically, the following steps are involved:

-   -   (1) Obtain regular motion candidates from A1, B1, B0, A0, B2,         Col and Col2 (similar as those in the regular merge mode)         without any pruning operations.     -   (2) Set variable numCurrMergeCand=0     -   (3) For each regular motion candidates derived from A1, B1, B0,         A0, B2, Col and Col2 and numCurrMergeCand is less than 5, if the         regular motion candidate is uni-prediction (either from List 0         or List 1), it is directly added to the merge list as an TPM         candidate with numCurrMergeCand increased by 1. Such a TPM         candidate is named “originally uni-predicted candidate”.     -   Full pruning is applied.     -   (4) For each motion candidates derived from A1, B1, B0, A0, B2,         Col and Col2 and numCurrMergeCand is less than 5, if the regular         motion candidate is bi-prediction, the motion information from         List 0 is added to the TPM merge list (that is, modified to be         uni-prediction from List 0) as a new TPM candidate and         numCurrMergeCand increased by 1. Such a TPM candidate is named         ‘Truncated List0-predicted candidate’.     -   Full pruning is applied.     -   (5) For each motion candidates derived from A1, B1, B0, A0, B2,         Col and Col2 and numCurrMergeCand is less than 5, if the regular         motion candidate is bi-prediction, the motion information from         List 1 is added to the TPM merge list (that is, modified to be         uni-prediction from List 1) and numCurrMergeCand increased by 1.         Such a TPM candidate is named ‘Truncated List1-predicted         candidate’.     -   Full pruning is applied.     -   (6) For each motion candidates derived from A1, B1, B0, A0, B2,         Col and Col2 and numCurrMergeCand is less than 5, if the regular         motion candidate is bi-prediction, the motion information of         List 1 is firstly scaled to List 0 reference picture, and the         average of the two MVs (one is from original List 0, and the         other is the scaled MV from List 1) is added to the TPM merge         list, such a candidate is called averaged uni-prediction from         List 0 motion candidate and numCurrMergeCand increased by 1.     -   Full pruning is applied.     -   (7) If numCurrMergeCand is less than 5, zero motion vector         candidates are added.

When inserting a candidate to the list, if it has to be compared to all previously added candidates to see whether it is identical to one of them, such a process is called full pruning.

Assume the scaled MV denoted by (MV_(1′x), MV_(1′y)) and the List 0 MV by (MV_(0x), MV_(0y)). The averaged uni-prediction from List 0 motion candidate denoted by (MV*_(x), MV*_(y)) is defined as:

MV*_(x)=(MV_(0x)+MV_(1′x)+1)>>1, and

MV*_(y)=(MV_(0y)+MV_(1′y)+1)>>1.

In some existing implementations, such as the affine prediction in JEM, MVs of each sub-block are calculated with the affine model as shown in Eq. (1) independently for each component, which may result in misalignment of motion vectors between luma and chroma components. Multiple calculations for the components also result in coding inefficiency. In some other existing implementations, the motion vector averaging operation to derive the pairwise merge candidate/averaged uni-prediction from List 0 motion candidate need to be aligned with the rounding method used in the sub-block prediction. It is thus desirable to obtain a unified design.

This patent document discloses techniques that can be implemented in various embodiments to calculate the MV of a sub-block of one component (e.g., a chroma component) from MV(s) of one or more sub-blocks of another component (e.g., a luma component). The disclosed techniques eliminate the need to determining MV(s) of different components multiple times, thereby improving video coding efficiency. The disclosed techniques also introduce a unified design with respect to the averaging operation and the round method.

The use of such techniques is elucidated in the following examples described for various implementations. In the following examples, which should not be construed to be limiting, Shift (x, s) is defined as Shift(x, s)=(x+off)>>s, and

SignShift (x, s) is defined as:

${{SignShift}\left( {x,s} \right)} = \left\{ {\begin{matrix} {\left( {x + {off}} \right)\mspace{14mu} \text{>>}\mspace{14mu} s} & {x \geq 0} \\ {- \left( {\left( {{- x} + {off}} \right)\mspace{14mu} \text{>>}\mspace{14mu} s} \right)} & {x < 0} \end{matrix}.} \right.$

Herein, off is an integer, e.g. 0 or 1<<(s−1).

In some embodiments, the MV of a sub-block of one component can be derived based on the MV(s) of one or more sub-blocks of another component. Here, the MV(s) of one or more sub-blocks of another component has (have) already been derived with the affine model. This way, there is no need to derive motion information multiple times.

In some embodiments, the HEVC standard defines how to derive the MV in chroma components (noted as mvC) from the MV used for MC in the luma component (noted as my). Generally speaking, mvC is calculated as my multiplying a factor, which relies on the color format, such as 4:2:0 or 4:2:2. FIG. 10 shows an example of deriving an MV of a component for sub-blocks in the 4:2:0 format in accordance with the present technology. In this example, the block size is 16×16 for Y (luma component) and 8×8 for Cb/Cr (chroma components). The sub-block size of the luma component is 4×4, while the sub-block size of the chroma components is 2×2. A MV* is first derived for a 4×4 sub-block in the Y component. The MVs of the 2×2 sub-block in the Cb and/or Cr components can be derived based on MV*. In this specific example, the value of MV* is copied first, and the MV(s) of the 2×2 sub-block in the Cb and/or Cr component(s) are calculated based on MV* according to the HEVC standard.

FIG. 11 shows another example of deriving an MV of a component for sub-blocks in the 4:2:0 format in accordance with the present technology. In this example, the block size is 16×16 for the luma component and 8×8 for a chroma component. The sub-block size of all the components is 4×4. A 4×4 sub-block in the Cb or Cr component corresponds to four 4×4 sub-block in the Y component. A MV* for the luma component is first calculated. The MV of the 4×4 sub-block in the Cb or Cr component is then derived based on MV* according to the HEVC standard.

In some embodiments, MV* is calculated as the average of all corresponding sub-block MVs in the Y component: MV*=(MV₀+MV₁+MV₂+MV₃)/4. Suppose MV*=(MV*_(x), MV*_(y)), MV₀=(MV_(0x), MV_(0y)), MV₁=(MV_(1x), MV_(1y)), MV₂=(MV_(2x), MV_(2y)) and MV₃=(MV_(3x), MV_(3y)).

In some embodiments, MV*_(x)=Shift (MV_(0x)+MV_(1x)+MV_(2x)+MV_(3x), 2), MV*_(y)=Shift (MV_(0y)+MV_(1y)+MV_(2y)+MV_(3y), 2). In some embodiments, MV*_(x)=SignShift (MV_(0x)+MV_(1x)+MV_(2x)+MV_(3x), 2), MV*_(y)=SignShift (MV_(0y)+MV_(1y)+MV_(2y)+MV_(3y), 2).

In some embodiments, the calculation of MV* can be performed using the following operations:

MV′_(x)=Shift(MV_(0x)+MV_(1x),1),  1.a

MV′_(y)=Shift(MV_(0y)+MV_(1y),1),  1.b

MV″_(x)=Shift(MV_(2x)+MV_(3x),1),  1.c

MV″_(y)=Shift(MV_(2y)+MV_(3y),1),  1.d

MV*_(x)=Shift(MV′_(x)+MV″_(x),1), and  1.e

MV*_(y)=Shift(MV′_(y)+MV″_(y),1).  1.f

In some embodiments, the calculation of MV* can be performed using the following operations:

MV′_(x)=Shift(MV_(0x)+MV_(2x),1),  2.a

MV′_(y)=Shift(MV_(0y)+MV_(2y),1),  2.b

MV″_(x)=Shift(MV_(1x)+MV_(3x),1),  2.c

MV″_(y)=Shift(MV_(1y)+MV_(3y),1),  2.d

MV*_(x)=Shift(MV′_(x)+MV″_(x),1), and  2.e

MV*_(y)=Shift(MV′_(y)+MV″_(y),1).  2.f

In some embodiments, the calculation of MV* can be performed using the following operations:

MV′x=SignShift(MV_(0x)+MV_(1x),1),  3.a

MV′_(y)=SignShift(MV_(0y)+MV_(1y),1),  3.b

MV″_(x)=SignShift(MV_(2x)+MV_(3x),1),  3.c

MV″_(y)=SignShift(MV_(2y)+MV_(3y),1),  3.d

MV*_(x)=SignShift(MV′_(x)+MV″_(x),1), and  3.e

MV*_(y)=SignShift(MV′_(y)+MV″_(y),1).  3.f

In some embodiments, the calculation of MV* can be performed using the following operations:

MV′_(x)=SignShift(MV_(0x)+MV_(2x),1),  4.a

MV′_(y)=SignShift(MV_(0y)+MV_(2y),1),  4.b

MV″_(x)=SignShift(MV_(1x)+MV_(3x),1),  4.c

MV″_(y)=SignShift(MV_(1y)+MV_(3y),1),  4.d

MV*_(x)=SignShift(MV′_(x)+MV″_(x),1), and  4.e

MV*_(y)=SignShift(MV′_(y)+MV″_(y),1).  4.f

In some embodiments, MV* is calculated based on the MV of top-left sub-block in the Y component (e.g., MV₀ as shown in FIG. 11). In some embodiments, MV* is calculated based on the MV of center sub-block in the Y component. In some embodiments, MV* is calculated based on the median MVs of all corresponding sub-blocks in the Y component. In this specific example shown in FIG. 11, MV*=median (MV₀, MV₁, MV₂, MV₃).

In some embodiments, the derivation of MVs of sub-blocks for color components can be determined based on the color format, such as 4:2:0, 4:2:2 and/or 4:4:4. For example, when the color format is 4:4:4, no subsampling occurs. The sub-block sizes and the number of sub-blocks in a block of video data are the same for all components. The MV of a sub-block in one component is the same as the MV of a corresponding sub-block in another component.

As another example, when the color format is 4:2:2. the sub-block sizes can be the same for all components, while the number of blocks can be different for different components. A MV* for the luma component is first calculated based on the MVs of several corresponding sub-blocks. The MV(s) of the corresponding sub-block in the Cb or Cr component is then derived from MV*.

FIG. 12 shows yet another example of deriving an MV of a component for sub-blocks in accordance with the present technology. In this example, the block size is 16×16 for the luma component and 8×16 for the chroma components. The sub-block size of all the components is 4×4. A 4×4 sub-block in the Cb or Cr component corresponds to two 4×4 sub-block in the Y component. A MV* for the luma component is first calculated. The MV of the 4×4 sub-block in the Cb or Cr component is then derived based on MV* according to the HEVC standard.

In some embodiments, MV* is calculated as the average of all corresponding sub-block MVs in the Y component: MV*=(MV₀+MV₁)/2. Suppose MV*=(MV*_(x), MV*_(y)), MV₀=(MV_(0x), MV_(0y)), MV₁=(MV_(1x), MV_(1y)),

In some embodiments, MV*_(x)=Shift (MV_(0x)+MV_(1x), 1), MV*_(y)=Shift (MV_(0y)+MV_(1y), 1). In some embodiments, MV*_(x)=SignShift (MV_(0x)+MV_(1x), 1), MV*_(y)=SignShift (MV_(0y)+MV_(1y), 1).

FIG. 13 is a flowchart of an example method 1300 for video encoding in accordance with one or more embodiments of the present technology. The method 1300 includes, at operation 1310, partitioning a first component of a current video block into a first set of sub-blocks. The method 1300 includes, at operation 1320, partitioning a second component of the current video block into a second set of sub-blocks. A sub-block of the second component corresponds to one or more sub-blocks of the first component. The method 1300 also includes, at operation 1330, deriving, based on a color format of the current video block, motion vectors for a sub-block of the second component based on motion vectors for one or more corresponding sub-blocks of the first color component.

FIG. 14 is a flowchart of another example method 1400 for video encoding in accordance with one or more embodiments of the present technology. The method 1400 includes, at operation 1410, receiving a block of video data that comprises a first component and at least a second component. The first component is partitioned into a first set of sub-blocks and the second component is partitioned into a second set of sub-blocks. A sub-block of the second component corresponds to one or more sub-blocks of the first component. The method 1400 includes, at operation 1420, deriving, based on a color format of the block of video data, motion vectors for a sub-block of the second component based on motion vectors for one or more corresponding sub-blocks of the first color component. The method 1400 includes, at operation 1430, reconstructing, based on the derived motion vectors, the block of video data or decoding other blocks of video data in a same picture.

In some embodiments, the sub-block of the second component corresponds to a sub-block of the first component. For example, these two sub-blocks may be spatially co-located in the picture. The method 1300 or 1400 further includes calculating an intermediate set of motion vectors by copying motion vectors of the sub-block of the first component and applying a factor to the intermediate set of motion vectors to obtain the derived motion vectors, wherein the factor is associated with the color format.

In some embodiments, the color format is not 4:4:4 (e.g., is 4:2:2, or 4:2:0) and the size of at least one of the first set of sub-blocks is different than the size of at least one of the second set sub-blocks. In some embodiments, the color format is 4:4:4 and the size of at least one of the first set of sub-blocks is same as the size of at least one of the second set sub-blocks.

In some embodiments, the color format is not 4:4:4 and a size of at least one of the first set of sub-blocks is same as a size of at least one of the second set sub-blocks. A sub-block of the second component corresponds to multiple sub-blocks of the first component. In some embodiments, at least one of the motion vectors for a sub-block of the second component is derived based on an average of corresponding motion vectors of the multiple sub-blocks of the first component.

In some implementations, the sub-block of the second component corresponds to four sub-blocks of the first component. The four sub-blocks have motion vectors MV₀=(MV_(0x), MV_(0y)), MV₁=(MV_(1x), MV_(1y)), MV₂=(MV_(2x), MV_(2y)) and MV₃=(MV_(3x), MV_(3y)) respectively. The method 1300 or 1400 includes calculating an intermediate set of motion vectors MV*=(MV*x, MV*y) as MV*x=Shift(MV0x+MV1x+MV2x+MV3x, 2) and MV*y=Shift(MVy0+MVy1+MVy2+MVy3,2), wherein Shift(x, s)=(x+off)>>s, wherein off and s are integers, and wherein >>represents a right shift operation. The method 1300 or 1400 also includes applying a factor to the intermediate set of motion vectors to obtain the derived motion vectors, wherein the factor is associated with the color format.

In some implementations, the sub-block of the second component corresponds to four sub-blocks of the first component. The four sub-blocks have motion vectors MV₀=(MV_(0x), MV_(0y)), MV₁=(MV_(1x), MV_(1y)), MV₂=(MV_(2x), MV_(2y)) and MV₃=(MV_(3x), MV_(3y)) respectively. The method 1300 or 1400 comprises calculating an intermediate set of motion vectors MV*=(MV*x, MV*y) as MV*x=SignShift(MV0x+MV1x+MV2x+MV3x, 2) and MV*y=SignShift(MV0y+MV1y+MV2y+MV3y, 2), wherein

${{SignShift}\left( {x,s} \right)} = \left\{ {\begin{matrix} {\left( {x + {off}} \right)\mspace{14mu} \text{>>}\mspace{14mu} s} & {x \geq 0} \\ {- \left( {\left( {{- x} + {off}} \right)\mspace{14mu} \text{>>}\mspace{14mu} s} \right)} & {x < 0} \end{matrix},} \right.$

wherein off and s are integers, and wherein >>represents a shift operation. The method 1300 or 1400 also includes applying a factor to the intermediate set of motion vectors to obtain the derived motion vectors, wherein the factor is associated with the color format.

In some implementations, the sub-block of the second component corresponds to four sub-blocks of the first component. The four sub-blocks have motion vectors MV₀=(MV_(0x), MV_(0y)), MV₁=(MV_(1x), MV_(1y)), MV₂=(MV_(2x), MV_(2y)) and MV₃=(MV_(3x), MV_(3y)) respectively. The method 1300 or 1400 includes calculating an intermediate set of motion vectors MV*=(MV*x, MV*y) as MV*x=Shift(MV′x+MV″x,1) and MV*y=Shift(MV′y+MV″y, 1), wherein MV′x=Shift(MV0x+MV1x, 1), MV′y=Shift(MV0y+MV1y,1), MV″x=Shift(MV2x+MV3x,1), and MV″y=Shift(MV2y+MV3y, 1), wherein Shift(x,s)=(x+off)>>s, wherein off and s are integers, and wherein >>represents a right shift operation. The method 1300 or 1400 also includes applying a factor to the intermediate set of motion vectors to obtain the derived motion vectors, wherein the factor is associated with the color format.

In some implementations, the sub-block of the second component corresponds to four sub-blocks of the first component. The four sub-blocks have motion vectors MV₀=(MV_(0x), MV_(0y)), MV₁=(MV_(1x), MV_(1y)), MV₂=(MV_(2x), MV_(2y)) and MV₃=(MV_(3x), MV_(3y)) respectively. The method 1300 or 1400 includes calculating an intermediate set of motion vectors MV*=(MV*x, MV*y) as MV*x=Shift(MV′x+MV″x, 1) and MV*y=Shift(MV′y+MV″y,1), wherein MV′x=Shift(MV0x+MV2x,1), MV′y=Shift(MV0y+MV2y,1), MV″x=Shift(MV1x+MV3x,1), and MV″y=Shift(MV1y+MV3y,1), wherein Shift(x, s)=(x+off)>>s, wherein off and s are integers, and wherein >>represents a right shift operation. The method 1300 or 1400 also includes applying a factor to the intermediate set of motion vectors to obtain the derived motion vectors, wherein the factor is associated with the color format.

In some implementations, the sub-block of the second component corresponds to four sub-blocks of the first component. The four sub-blocks have motion vectors MV₀=(MV_(0x), MV_(0y)), MV₁=(MV_(1x), MV_(1y)), MV₂=(MV_(2x), MV_(2y)) and MV₃=(MV_(3x), MV_(3y)) respectively. The method 1300 or 1400 includes calculating an intermediate set of motion vectors MV*=(MV*x, MV*y) as MV*x=SignShift(MV′x+MV″x, 1) and MV*y=SignShift(MV′y+MV″y, 1), wherein MV′x=SignShift(MV0x+MV1x,1), MV′y=SignShift(MV0y+MV1y, 1), MV″x=SignShift(MV2x+MV3x, 1), and MV″y=SignShift(MV2y+MV3y, 1), wherein

${{SignShift}\left( {x,s} \right)} = \left\{ {\begin{matrix} {\left( {x + {off}} \right)\mspace{14mu} \text{>>}\mspace{14mu} s} & {x \geq 0} \\ {- \left( {\left( {{- x} + {off}} \right)\mspace{14mu} \text{>>}\mspace{14mu} s} \right)} & {x < 0} \end{matrix},} \right.$

wherein off and s are integers, and wherein >>represents a shift operation. The method 1300 or 1400 also includes applying a factor to the intermediate set of motion vectors to obtain the derived motion vectors, wherein the factor is associated with the color format.

In some implementations, the sub-block of the second component corresponds to four sub-blocks of the first component. The four sub-blocks have motion vectors MV₀=(MV_(0x), MV_(0y)), MV₁=(MV_(1x), MV_(1y)), MV₂=(MV_(2x), MV_(2y)) and MV₃=(MV_(3x), MV_(3y)) respectively. The method 1300 or 1400 includes calculating an intermediate set of motion vectors MV*=(MV*x, MV*y) as MV*x=SignShift(MV′x+MV″x, 1) and MV*y=SignShift(MV′y+MV″y,1), wherein MV′x=SignShift(MV0x+MV2x,1), MV′y=SignShift(MV0y+MV2y, 1), MV″x=SignShift(MV1x+MV3x, 1), and MV″y=SignShift(MV1y+MV3y,1), wherein

${{SignShift}\left( {x,s} \right)} = \left\{ {\begin{matrix} {\left( {x + {off}} \right)\mspace{14mu} \text{>>}\mspace{14mu} s} & {x \geq 0} \\ {- \left( {\left( {{- x} + {off}} \right)\mspace{14mu} \text{>>}\mspace{14mu} s} \right)} & {x < 0} \end{matrix},} \right.$

wherein off and s are integers, and wherein >>represents a shift operation. The method 1300 or 1400 also includes applying a factor to the intermediate set of motion vectors to obtain the derived motion vectors, wherein the factor is associated with the color format.

In some implementations, the sub-block of the second component corresponds to two sub-blocks of the first component. The two sub-blocks have motion vectors MV₀=(MV_(0x), MV_(0y)) and MV₁=(MV_(1x), MV_(1y)) respectively. The method 1300 or 1400 includes calculating an intermediate set of motion vectors MV*=(MV*x, MV*y) as MV*x=Shift(MV0x+MV1x, 1) and MV*y=Shift(MVy0+MVy1,1), wherein Shift(x, s)=(x+off)>>s, wherein off and s are integers, and wherein >>represents a right shift operation. The method 1300 or 1400 also includes applying a factor to the intermediate set of motion vectors to obtain the derived motion vectors, wherein the factor is associated with the color format.

In some implementations, the sub-block of the second component corresponds to two sub-blocks of the first component. The two sub-blocks have motion vectors MV₀=(MV0x, MV_(0y)) and MV₁=(MV_(1x), MV_(1y)) respectively.

The method 1300 or 1400 includes calculating an intermediate set of motion vectors MV*=(MV*x, MV*y) as MV*x=SignShift(MV0x+MV1x,1) and MV*y=SignShift(MVy0+MVy1,1), wherein

${{SignShift}\left( {x,s} \right)} = \left\{ {\begin{matrix} {\left( {x + {off}} \right)\mspace{14mu} \text{>>}\mspace{14mu} s} & {x \geq 0} \\ {- \left( {\left( {{- x} + {off}} \right)\mspace{14mu} \text{>>}\mspace{14mu} s} \right)} & {x < 0} \end{matrix},} \right.$

wherein off and s are integers, and wherein >>represents a shift operation. The method 1300 or 1400 also includes applying a factor to the intermediate set of motion vectors to obtain the derived motion vectors, wherein the factor is associated with the color format.

In some embodiments, the method 1300 or 1400 further comprises calculating an intermediate set of motion vectors based on motion vectors of a selected sub-block among the multiple sub-blocks of the first component and applying a factor to the intermediate set of motion vectors to obtain the derived motion vectors. The factor is associated with the color format. In some implementations, the selected sub-block is a top-left sub-block of the multiple sub-blocks of the first component. In some implementations, the selected sub-block is a center sub-block of the multiple sub-blocks of the first component.

In some embodiments, the method 1300 or 1400 includes calculating an intermediate set of motion vectors based on a median of motion vectors of the multiple sub-blocks of the first component and applying a factor to the intermediate set of motion vectors to obtain the derived motion vectors, wherein the factor is associated with the color format.

In some embodiments, the applying of the factor is specified in a High Efficiency Video Coding (HEVC) standard.

The examples described above may be incorporated in the context of the methods described below, e.g., methods 1300 and 1400, which may be implemented at a video decoder and/or video encoder.

FIG. 15 is a block diagram illustrating an example encoding apparatus 1500 that can be utilized to implement various portions of the presently disclosed technology, including (but not limited to) method 1300 and method 1400. The encoding apparatus 1500 includes a quantizer 1505 for compressing input data bits. The encoding apparatus 1500 also includes a dequantizer 1515 so that data bits can be fed into memory 1525 and predictor 1520 to perform motion estimation. The encoding apparatus 1500 further includes a binary encoder 1530 to generated encoded binary codes.

FIG. 16 is a block diagram illustrating an example encoding apparatus 1600 that can be utilized to implement various portions of the presently disclosed technology, including (but not limited to) method 1300 and method 1400. The decoding apparatus 1600 includes a bindery decoder 1605 to decode the binary codes. The decoding apparatus 1600 also includes a dequantizer 1615 so that decoded data bits can be fed into memory 1625 and predictor 1620 to perform motion estimation on the decoding side.

FIG. 17 is a block diagram illustrating an example of the architecture for a computer system or other control device 1700 that can be utilized to implement various portions of the presently disclosed technology, including (but not limited to) method 1300 and method 1400. In FIG. 17, the computer system 1700 includes one or more processors 1705 and memory 1710 connected via an interconnect 1725. The interconnect 1725 may represent any one or more separate physical buses, point to point connections, or both, connected by appropriate bridges, adapters, or controllers. The interconnect 1725, therefore, may include, for example, a system bus, a Peripheral Component Interconnect (PCI) bus, a HyperTransport or industry standard architecture (ISA) bus, a small computer system interface (SCSI) bus, a universal serial bus (USB), IIC (I2C) bus, or an Institute of Electrical and Electronics Engineers (IEEE) standard 674 bus, sometimes referred to as “Firewire.”

The processor(s) 1705 may include central processing units (CPUs) to control the overall operation of, for example, the host computer. In certain embodiments, the processor(s) 1705 accomplish this by executing software or firmware stored in memory 1710. The processor(s) 1705 may be, or may include, one or more programmable general-purpose or special-purpose microprocessors, digital signal processors (DSPs), programmable controllers, application specific integrated circuits (ASICs), programmable logic devices (PLDs), or the like, or a combination of such devices.

The memory 1710 can be or include the main memory of the computer system. The memory 1710 represents any suitable form of random access memory (RAM), read-only memory (ROM), flash memory, or the like, or a combination of such devices. In use, the memory 1710 may contain, among other things, a set of machine instructions which, when executed by processor 1705, causes the processor 1705 to perform operations to implement embodiments of the presently disclosed technology.

Also connected to the processor(s) 1705 through the interconnect 1725 is a (optional) network adapter 1715. The network adapter 1715 provides the computer system 1700 with the ability to communicate with remote devices, such as the storage clients, and/or other storage servers, and may be, for example, an Ethernet adapter or Fiber Channel adapter.

FIG. 18 shows a block diagram of an example embodiment of a mobile device 1800 that can be utilized to implement various portions of the presently disclosed technology, including (but not limited to) method 1600. The mobile device 1800 can be a laptop, a smartphone, a tablet, a camcorder, or other types of devices that are capable of processing videos. The mobile device 1800 includes a processor or controller 1801 to process data, and memory 1802 in communication with the processor 1801 to store and/or buffer data. For example, the processor 1801 can include a central processing unit (CPU) or a microcontroller unit (MCU). In some implementations, the processor 1801 can include a field-programmable gate-array (FPGA). In some implementations, the mobile device 1800 includes or is in communication with a graphics processing unit (GPU), video processing unit (VPU) and/or wireless communications unit for various visual and/or communications data processing functions of the smartphone device. For example, the memory 1802 can include and store processor-executable code, which when executed by the processor 1801, configures the mobile device 1800 to perform various operations, e.g., such as receiving information, commands, and/or data, processing information and data, and transmitting or providing processed information/data to another device, such as an actuator or external display.

To support various functions of the mobile device 1800, the memory 1802 can store information and data, such as instructions, software, values, images, and other data processed or referenced by the processor 1801. For example, various types of Random Access Memory (RAM) devices, Read Only Memory (ROM) devices, Flash Memory devices, and other suitable storage media can be used to implement storage functions of the memory 1802. In some implementations, the mobile device 1800 includes an input/output (I/O) unit 1803 to interface the processor 1801 and/or memory 1802 to other modules, units or devices. For example, the I/O unit 1803 can interface the processor 1801 and memory 1802 with to utilize various types of wireless interfaces compatible with typical data communication standards, e.g., such as between the one or more computers in the cloud and the user device. In some implementations, the mobile device 1800 can interface with other devices using a wired connection via the I/O unit 1803. The mobile device 1800 can also interface with other external interfaces, such as data storage, and/or visual or audio display devices 1804, to retrieve and transfer data and information that can be processed by the processor, stored in the memory, or exhibited on an output unit of a display device 1804 or an external device. For example, the display device 1804 can display a video frame that includes a block (a CU, PU or TU) that applies the intra-block copy based on whether the block is encoded using a motion compensation algorithm, and in accordance with the disclosed technology.

From the foregoing, it will be appreciated that specific embodiments of the presently disclosed technology have been described herein for purposes of illustration, but that various modifications may be made without deviating from the scope of the invention. Accordingly, the presently disclosed technology is not limited except as by the appended claims.

Implementations of the subject matter and the functional operations described in this patent document can be implemented in various systems, digital electronic circuitry, or in computer software, firmware, or hardware, including the structures disclosed in this specification and their structural equivalents, or in combinations of one or more of them. Implementations of the subject matter described in this specification can be implemented as one or more computer program products, i.e., one or more modules of computer program instructions encoded on a tangible and non-transitory computer readable medium for execution by, or to control the operation of, data processing apparatus. The computer readable medium can be a machine-readable storage device, a machine-readable storage substrate, a memory device, a composition of matter effecting a machine-readable propagated signal, or a combination of one or more of them. The term “data processing unit” or “data processing apparatus” encompasses all apparatus, devices, and machines for processing data, including by way of example a programmable processor, a computer, or multiple processors or computers. The apparatus can include, in addition to hardware, code that creates an execution environment for the computer program in question, e.g., code that constitutes processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of them.

A computer program (also known as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program does not necessarily correspond to a file in a file system. A program can be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files that store one or more modules, sub programs, or portions of code). A computer program can be deployed to be executed on one computer or on multiple computers that are located at one site or distributed across multiple sites and interconnected by a communication network.

The processes and logic flows described in this specification can be performed by one or more programmable processors executing one or more computer programs to perform functions by operating on input data and generating output. The processes and logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application specific integrated circuit).

Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer. Generally, a processor will receive instructions and data from a read only memory or a random access memory or both. The essential elements of a computer are a processor for performing instructions and one or more memory devices for storing instructions and data. Generally, a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto optical disks, or optical disks. However, a computer need not have such devices. Computer readable media suitable for storing computer program instructions and data include all forms of nonvolatile memory, media and memory devices, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices. The processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.

It is intended that the specification, together with the drawings, be considered exemplary only, where exemplary means an example. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. Additionally, the use of “or” is intended to include “and/or”, unless the context clearly indicates otherwise.

While this patent document contains many specifics, these should not be construed as limitations on the scope of any invention or of what may be claimed, but rather as descriptions of features that may be specific to particular embodiments of particular inventions. Certain features that are described in this patent document in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.

Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. Moreover, the separation of various system components in the embodiments described in this patent document should not be understood as requiring such separation in all embodiments.

Only a few implementations and examples are described and other implementations, enhancements and variations can be made based on what is described and illustrated in this patent document. 

What is claimed is:
 1. A method of coding video data, comprising: determining, during a conversion between a current video block of a video and a bitstream representation of the video, that motion vectors of control points of the current video block based on an affine mode, wherein the current video block comprises a luma component and at least one chroma component; dividing the luma component into luma sub-blocks; dividing a chroma component of the at least one chroma component into chroma sub-blocks; determining a luma motion vector for each luma sub-block based on the motion vectors of the control points; deriving a chroma motion vector for each chroma sub-block based on luma motion vectors of multiple corresponding luma sub-blocks and a color format of the current video block; and reconstructing the luma component based on the luma motion vector of each luma sub-block.
 2. The method of claim 1, wherein deriving the chroma motion vector for each chroma sub-block further comprising: determining the chroma component is divided into at least one first chroma group, wherein the first chroma group includes two or four chroma sub-blocks according to the color format of the current video block; deriving a group chroma motion vector for each one of the at least one first chroma group; and assigning the group chroma motion vector to each sub-block of the corresponding first chroma group.
 3. The method of claim 2, wherein the group chroma motion vector is derived based on applying a scaling factor to an intermediate motion vector.
 4. The method of claim 3, wherein the first chroma group includes two chroma sub-blocks in a case that the color format is 4:2:2, two luma sub-blocks corresponding to the two chroma sub-blocks has motion vectors MV₀ and MV₁ respectively, and wherein the intermediate motion vector MV* is derived based on the MV₀ and the MV₁.
 5. The method of claim 4, wherein the intermediate motion vector is derived based on applying an offset-based averaging operation on the MV₀ and the MV₁.
 6. The method of claim 5, wherein the intermediate motion vector MV*=Shift(MV₀+MV₁,1), wherein Shift(x,1)=(x+offset)>>1, offset is equal to 0 or 1, and wherein >>represents a right shift operation.
 7. The method of claim 3, wherein the first chroma group includes four chroma sub-blocks in a case that the color format is 4:2:0, a top-left one of four luma sub-blocks has motion vector MV₀, a top-right one of the four sub-blocks has motion vector MV₁, a bottom-left one of the four sub-blocks has motion vector MV₂ and a bottom-right one of the four sub-blocks has motion vector MV₃, and wherein the four luma sub-blocks correspond to the four chroma sub-blocks and the intermediate motion vector MV* is derived at least based on the MV₀ and the MV₃.
 8. The method of claim 7, wherein the intermediate motion vector is derived based on applying an offset-based averaging operation at least on the MV₀ and MV₃.
 9. The method of claim 2, further comprising: reconstructing the chroma component based on the group chroma motion vector.
 10. The method of claim 9, wherein reconstructing the chroma component in units of the first chroma group.
 11. The method of claim 1, wherein the conversion includes encoding the current video block into the bitstream representation.
 12. The method of claim 1, wherein the conversion includes decoding the current video block from the bitstream representation.
 13. An apparatus for coding video data comprising a processor and a non-transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to: determining, during a conversion between a current video block of a video and a bitstream representation of the video, that motion vectors of control points of the current video block based on an affine mode, wherein the current video block comprises a luma component and at least one chroma component; dividing the luma component into luma sub-blocks; dividing a chroma component of the at least one chroma component into chroma sub-blocks; determining a luma motion vector for each luma sub-block based on the motion vectors of the control points; deriving a chroma motion vector for each chroma sub-block based on luma motion vectors of multiple corresponding luma sub-blocks and a color format of the current video block; and reconstructing the luma component based on the luma motion vector of each luma sub-block.
 14. The apparatus of claim 13, wherein deriving the chroma motion vector for each chroma sub-block further comprising: determining the chroma component is divided into at least one first chroma group, wherein the first chroma group includes two or four chroma sub-blocks according to the color format of the current video block; deriving a group chroma motion vector for each one of the at least one first chroma group; and assigning the group chroma motion vector to each sub-block of the corresponding first chroma group.
 15. The apparatus of claim 14, wherein the group chroma motion vector is derived based on applying a scaling factor to an intermediate motion vector.
 16. The apparatus of claim 15, wherein the first chroma group includes two chroma sub-blocks in a case that the color format is 4:2:2, two luma sub-blocks corresponding to the two chroma sub-blocks has motion vectors MV₀ and MV₁ respectively, and wherein the intermediate motion vector MV* is derived based on the MV₀ and the MV₁.
 17. The apparatus of claim 16, wherein the intermediate motion vector is derived based on applying an offset-based averaging operation on the MV₀ and the MV₁.
 18. The apparatus of claim 17, wherein the intermediate motion vector MV*=Shift(MV₀+MV₁,1), wherein Shift(x,1)=(x+offset)>>1, offset is equal to 0 or 1, and wherein >>represents a right shift operation.
 19. A non-transitory computer-readable storage medium storing instructions that cause a processor to: determining, during a conversion between a current video block of a video and a bitstream representation of the video, that motion vectors of control points of the current video block based on an affine mode, wherein the current video block comprises a luma component and at least one chroma component; dividing the luma component into luma sub-blocks; dividing a chroma component of the at least one chroma component into chroma sub-blocks; determining a luma motion vector for each luma sub-block based on the motion vectors of the control points; deriving a chroma motion vector for each chroma sub-block based on luma motion vectors of multiple corresponding luma sub-blocks and a color format of the current video block; and reconstructing the luma component based on the luma motion vector of each luma sub-block.
 20. A non-transitory computer-readable recording medium storing a bitstream representation which is generated by a method performed by a video processing apparatus, wherein the method comprises: determining, during a conversion between a current video block of a video and a bitstream representation of the video, that motion vectors of control points of the current video block based on an affine mode, wherein the current video block comprises a luma component and at least one chroma component; dividing the luma component into luma sub-blocks; dividing a chroma component of the at least one chroma component into chroma sub-blocks; determining a luma motion vector for each luma sub-block based on the motion vectors of the control points; deriving a chroma motion vector for each chroma sub-block based on luma motion vectors of multiple corresponding luma sub-blocks and a color format of the current video block; and generating the bitstream representation from the current video block based on above determining and dividing, wherein the conversion include reconstructing the luma component based on the luma motion vector of each luma sub-block. 